Matrix computation of subresultant polynomial remainder sequences in integral domains

We present an impr{wed variant of the matrix-triangularization subresultant prs method [1] fi~r the computation of a greatest comnum divi~w of two polynomials A and B (of degrees m and n, respectively) along with their polynomial remainder ~quence. It is impr~wed in the sense that we obtain complete theoretical results, independent {}f Van Vleck's theorem [13] (which is not always tnle [2, 6]), and, instead of transfornfing a matrix of order 2 .max(m, n) [1], we are now transforming a matrix of order m + n. An example is al.,a~ induded to clarify the concepts.